Vertex Ordering, Clustering, and Their Application to Graph Partitioning
نویسندگان
چکیده
We propose a new heuristic for vertex ordering and a method that splits the vertex ordering into clusters. We apply them to the graph partitioning problem. The application of these ideas incorporates reordering in genetic algorithms and the identification of clustered structures in graphs. Experimental tests on benchmark graphs showed that the new vertex-ordering scheme performed better than existing methods in terms of genetic algorithms, and that the clusters were successfully captured.
منابع مشابه
ork for S s to Circuit CI
Vertex orderings have been successfully applied to problems in netlist clustering and for system partitioning and layout [2] , [20]. We present a vertex ordering construction that encompasses most reasonable graph traversals. Two parameters-an attraction function and a window-provide the means for achieving various graph traversals and addressing particular clustering requirements. We then use ...
متن کاملClustering Test Ordering Algorithm
Vertex orderings have been successfully applied to problems in netlist clustering, for system partitioning and layout [2] [20]. We present a vertex ordering construction that encompasses most reasonable graph traversals. Two parameters { an attraction function and a window { provide the means for achieving various graph traversals and addressing particular clustering requirements. We then use d...
متن کاملSIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM
Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $A(G)$ the adjacency matrix of $G$. The signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
متن کاملHypergraph-Partitioning-Based Sparse Matrix Ordering
Introduction In this work we propose novel sparse matrix ordering approaches based on hypergraph partitioning. The significance of hypergraph-partitioning-based (HP-based) ordering is three-fold. First, almost all of the successful nested dissection [6] tools [7, 9, 10] are based on multilevel graph partitioning tools [7, 8, 10] with some extra initial partitioning and refinement strategies spe...
متن کاملHypergraph Partitioning-based Fill-reducing Ordering
A typical first step of a direct solver for linear system Mx = b is reordering of symmetric matrix M to improve execution time and space requirements of the solution process. In this work, we propose a novel nesteddissection-based ordering approach that utilizes hypergraph partitioning. Our approach is based on formulation of graph partitioning by vertex separator (GPVS) problem as a hypergraph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013